The Claude Shannon Institute Workshop on Coding & Cryptography 23 rd & 24 th May 2011 Kane Building , UCC

نویسندگان

  • PATRICK FITZPATRICK
  • GARY MCGUIRE
چکیده

Hosted by: The Claude Shannon Institute for Discrete Mathematics, Coding, Cryptography and Information Security, The Boole Centre for Research in Informatics, UCC School of Engineering, UCC School of Mathematical Sciences, UCC

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Report on the WebQuality 2015 Workshop

The 5 th International Workshop on Web Quality (WebQuality 2015) was held in conjunction with the 24 rd International World Wide Web Conference in Florence, Italy on the 18 th May 2015. This report briefly summarizes the workshop.

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

How to Work Collaboratively Within the Health System: Workshop Summary and Facilitator Reflection

Effectiveness in health services research requires development of specific knowledge and skills for working in partnership with health system decision-makers. In an initial effort to frame capacity-building activities for researchers, we designed a workshop on working collaboratively within the health system. The workshop, based on recent research exploring health syste...

متن کامل

One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems

In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This turns out to be a special case of Grangetto’s randomized arithmetic coding performed on the Binary Map. Furthermore, we derive the set of possible perfect secrecy systems using such an approa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011